MONEDA: scalable multi-objective optimization with a neural network-based estimation of distribution algorithm

The Extension Of Estimation Of Distribution Algorithms (Edas) To The Multiobjective Domain Has Led To Multi-Objective Optimization Edas (Moedas). Most Moedas Have Limited Themselves To Porting Single-Objective Edas To The Multi-Objective Domain. Although Moedas Have Proved To Be A Valid Approach, The Last Point Is An Obstacle To The Achievement Of A Significant Improvement Regarding "Standard" Multi-Objective Optimization Evolutionary Algorithms. Adapting The Model-Building Algorithm Is One Way To Achieve A Substantial Advance. Most Model-Building Schemes Used So Far By Edas Employ Off-The-Shelf Machine Learning Methods. However, The Model-Building Problem Has Particular Requirements That Those Methods Do Not Meet And Even Evade. The Focus Of This Paper Is On The Model- Building Issue And How It Has Not Been Properly Understood And Addressed By Most Moedas. We Delve Down Into The Roots Of This Matter And Hypothesize About Its Causes. To Gain A Deeper Understanding Of The Subject We Propose A Novel Algorithm Intended To Overcome The Draw-Backs Of Current Moedas. This New Algorithm Is The Multi-Objective Neural Estimation Of Distribution Algorithm (Moneda). Moneda Uses A Modified Growing Neural Gas Network For Model-Building (Mb-Gng). Mb-Gng Is A Custom-Made Clustering Algorithm That Meets The Above Demands. Thanks To Its Custom-Made Model-Building Algorithm, The Preservation Of Elite Individuals And Its Individual Replacement Scheme, Moneda Is Capable Of Scalably Solving Continuous Multi-Objective Optimization Problems. It Performs Better Than Similar Algorithms In Terms Of A Set Of Quality Indicators And Computational Resource Requirements.This work has been funded in part by projects CNPq BJT 407851/2012-7, FAPERJ APQ1 211.451/2015, MINECO TEC2014-57022-C2-2-R and TEC2012-37832-C02-01

Multi-objective optimization with an adaptive resonance theory-based estimation of distribution algorithm

The introduction of learning to the search mechanisms of optimization algorithms has been nominated as one of the viable approaches when dealing with complex optimization problems, in particular with multi-objective ones. One of the forms of carrying out this hybridization process is by using multi-objective optimization estimation of distribution algorithms (MOEDAs). However, it has been pointed out that current MOEDAs have an intrinsic shortcoming in their model-building algorithms that hamper their performance. In this work, we put forward the argument that error-based learning, the class of learning most commonly used in MOEDAs is responsible for current MOEDA underachievement. We present adaptive resonance theory (ART) as a suitable learning paradigm alternative and present a novel algorithm called multi-objective ART-based EDA (MARTEDA) that uses a Gaussian ART neural network for model-building and a hypervolume-based selector as described for the HypE algorithm. In order to assert the improvement obtained by combining two cutting-edge approaches to optimization an extensive set of experiments are carried out. These experiments also test the scalability of MARTEDA as the number of objective functions increases.This work was supported by projects Projects CICYT TIN2011-28620-C02- 01, CICYT TEC2011-28626-C02-02, CAM CONTEXTS (S2009/TIC-1485) and DPS2008-07029-C02-02.Publicad

Neural networks robot controller trained with evolution strategies

Congress on Evolutionary Computation. Washington, DC, 6-9 July 1999.Neural networks (NN) can be used as controllers in autonomous robots. The specific features of the navigation problem in robotics make generation of good training sets for the NN difficult. An evolution strategy (ES) is introduced to learn the weights of the NN instead of the learning method of the network. The ES is used to learn high performance reactive behavior for navigation and collision avoidance. No subjective information about “how to accomplish the task” has been included in the fitness function. The learned behaviors are able to solve the problem in different environments; therefore, the learning process has the proven ability to obtain a specialized behavior. All the behaviors obtained have been tested in a set of environments and the capability of generalization is shown for each learned behavior. A simulator based on the mini-robot, Khepera, has been used to learn each behavior

Uniform coevolution for solving the density classification problem in cellular automata

Genetic and Evolutionary Computation Conference (GECCO 2000). Las Vegas, Nevada (USA), July 8-12 2000.Uniform Coevolution is based on competitive evolution ideas where the solution and example sets are evolving by means of a competition to generate difficult test beds for the solutions in a gradual way. The method has been tested with the density parity problem in cellular automata, where the selected examples can biased the solutions founded. The results show a high value of generality using Uniform coevolution, compared with no Co-evolutive approaches.Publicad

Hierarchical genetic algorithms for composite laminate panels stress optimisation

IEEE International Conference on Systems, Man, and Cybernetics. Tokyo, 12-15 October 1999.Genetic algorithms (GAs) have demonstrated to be a powerful technique for solving optimisation problems. In this article, the problem of optimising the number of plies and their stacking sequence in the design of laminated composite panels is considered. This problem has special features that makes it different from traditional problems in which GAs have been applied, which make the problem a multiobjective optimisation one. Symmetry and equilibrium constraints have also been included in the solution. A modification of the canonical GA is needed and a new perspective for solving this problem by using GA techniques is introduced

Hydroelectric power plant management relying on neural networks and expert system integration

The use of Neural Networks (NN) is a novel approach that can help in taking decisions when integrated in a more general system, in particular with expert systems. In this paper, an architecture for the management of hydroelectric power plants is introduced. This relies on monitoring a large number of signals, representing the technical parameters of the real plant. The general architecture is composed of an Expert System and two NN modules: Acoustic Prediction (NNAP) and Predictive Maintenance (NNPM). The NNAP is based on Kohonen Learning Vector Quantization (LVQ) Networks in order to distinguish the sounds emitted by electricity-generating machine groups. The NNPM uses an ART-MAP to identify different situations from the plant state variables, in order to prevent future malfunctions. In addition, a special process to generate a complete training set has been designed for the ART-MAP module. This process has been developed to deal with the absence of data about abnormal plant situations, and is based on neural nets trained with the backpropagation algorithm.Publicad

Neural network controller against environment: A coevolutive approach to generalize robot navigation behavior

In this paper, a new coevolutive method, called Uniform Coevolution, is introduced to learn weights of a neural network controller in autonomous robots. An evolutionary strategy is used to learn high-performance reactive behavior for navigation and collisions avoidance. The introduction of coevolutive over evolutionary strategies allows evolving the environment, to learn a general behavior able to solve the problem in different environments. Using a traditional evolutionary strategy method, without coevolution, the learning process obtains a specialized behavior. All the behaviors obtained, with/without coevolution have been tested in a set of environments and the capability of generalization is shown for each learned behavior. A simulator based on a mini-robot Khepera has been used to learn each behavior. The results show that Uniform Coevolution obtains better generalized solutions to examples-based problems.Publicad

An enhanced classifier system for autonomous robot navigation in dynamic environments

In many cases, a real robot application requires the navigation in dynamic environments. The navigation problem involves two main tasks: to avoid obstacles and to reach a goal. Generally, this problem could be faced considering reactions and sequences of actions. For solving the navigation problem a complete controller, including actions and reactions, is needed. Machine learning techniques has been applied to learn these controllers. Classifier Systems (CS) have proven their ability of continuos learning in these domains. However, CS have some problems in reactive systems. In this paper, a modified CS is proposed to overcome these problems. Two special mechanisms are included in the developed CS to allow the learning of both reactions and sequences of actions. The learning process has been divided in two main tasks: first, the discrimination between a predefined set of rules and second, the discovery of new rules to obtain a successful operation in dynamic environments. Different experiments have been carried out using a mini-robot Khepera to find a generalised solution. The results show the ability of the system to continuous learning and adaptation to new situations.Publicad

A general learning co-evolution method to generalize autonomous robot navigation behavior

Congress on Evolutionary Computation. La Jolla, CA, 16-19 July 2000.A new coevolutive method, called Uniform Coevolution, is introduced, to learn weights for a neural network controller in autonomous robots. An evolutionary strategy is used to learn high-performance reactive behavior for navigation and collision avoidance. The coevolutive method allows the evolution of the environment, to learn a general behavior able to solve the problem in different environments. Using a traditional evolutionary strategy method without coevolution, the learning process obtains a specialized behavior. All the behaviors obtained, with or without coevolution have been tested in a set of environments and the capability for generalization has been shown for each learned behavior. A simulator based on the mini-robot Khepera has been used to learn each behavior. The results show that Uniform Coevolution obtains better generalized solutions to example-based problems

Distance modulation competitive co-evolution method to find initial configuration independent cellular automata rules

IEEE International Conference on Systems, Man, and Cybernetics. Tokyo, 12-15 October 1999.One of the main problems in machine learning methods based on examples is the over-adaptation. This problem supposes the exact adaptation to the training examples losing the capability of generalization. A solution of these problems arises in using large sets of examples. In most of the problems, to achieve generalized solutions, almost infinity examples sets are needed. This make the method useless in practice. In this paper, one way to overcome this problem is proposed, based on biological competitive evolution ideas. The evolution is produced as a result of a competition between sets of solutions and sets of examples, trying to beat each other. This mechanism allows the generation of generalized solutions using short example sets